Detachments Preserving Local Edge-Connectivity of Graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Detachments Preserving Local Edge-Connectivity of Graphs

Let G = (V + s,E) be a graph and let S = (d1, ..., dp) be a set of positive integers with ∑ dj = d(s). An S-detachment splits s into a set of p independent vertices s1, ..., sp with d(sj) = dj , 1 ≤ j ≤ p. Given a requirement function r(u, v) on pairs of vertices of V , an S-detachment is called r-admissible if the detached graph G satisfies λG′(x, y) ≥ r(x, y) for every pair x, y ∈ V . Here λH...

متن کامل

Edge-splittings preserving local edge-connectivity of graphs

Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) preserves the local edge-connectivity (the maximum number of pairwise edge disjoint paths) between each pair of vertices in V. The operation splitting off is very useful in graph theory, it is especially powerful in the s...

متن کامل

Eulerian detachments with local edge-connectivity

For a graph G, a detachment operation at a vertex transforms the graph into a new graph by splitting the vertex into several vertices in such a way that the original graph can be obtained by contracting all the split vertices into a single vertex. A graph obtained from a given graph G by applying detachment operations at several vertices is called a detachment of graph G. We consider a detachme...

متن کامل

On the edge-connectivity of C_4-free graphs

Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...

متن کامل

Detachment of Vertices of Graphs Preserving Edge-Connectivity

The detachment of vertex is the inverse operation of merging vertices s1, . . . , st into s. We speak about {d1, . . . , dt}-detachment if for the detached graph G′ the new degrees are specified as dG′(s1) = d1, . . . , dG′(st) = dt. We call a detachment k-feasible if dG′(X) ≥ k whenever X separates two vertices of V (G)−s. In our main theorem, we give a necessary and sufficient condition for t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BRICS Report Series

سال: 1999

ISSN: 1601-5355,0909-0878

DOI: 10.7146/brics.v6i35.20104